Logic-programming specification and execution of dynamic-programming problems

Maude: specification and programming in rewriting logic

Dynamic Logic Programming

In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow default negation not only in rule bodies but also in their heads.We start by introducing the notion of an update P U of a logic program P by another logic program U . Subsequently, we provide a precise semantic character...

A dynamic programming approach for solving nonlinear knapsack problems

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

Dynamic Logic Programming and 3APL

3APL is a widely known multi-agent programming language. However, 3APL, when to be used in certain domains and environments, has the following limitations: • limited update operator that only allows for updates to the extensional part of the belief base; • lack of a language with both default and strong negation to enable the representation and reasoning about knowledge with the open and closed...

Enhancing Disjunctive Logic Programming for Ontology Specification

This paper is a presentation of ONTO-DLP, an extension of Disjunctive Logic Programming (DLP) for complex knowledge modelling. ONTO-DLP enhances DLP by constructs coming from other knowledge representation formalisms, namely, Complex-Datalog and Ordered Logic. The former provides suitable abstraction mechanisms for complex objects handling, while the latter provides support for default reasonin...